Memristive Excitable Cellular Automata

نویسندگان

  • Andrew Adamatzky
  • Leon O. Chua
چکیده

The memristor is a device whose resistance changes depending on the polarity and magnitude of a voltage applied to the device’s terminals. We design a minimalistic model of a regular network of memristors using structurally-dynamic cellular automata. Each cell gets info about states of its closest neighbours via incoming links. A link can be one ’conductive’ or ’non-conductive’ states. States of every link are updated depending on states of cells the link connects. Every cell of a memristive automaton takes three states: resting, excited (analog of positive polarity) and refractory (analog of negative polarity). A cell updates its state depending on states of its closest neighbours which are connected to the cell via ’conductive’ links. We study behaviour of memristive automata in response to point-wise and spatially extended perturbations, structure of localised excitations coupled with topological defects, interfacial mobile excitations and growth of information pathways.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Phenomenology of retained refractoriness: On semi-memristive discrete media

We study two-dimensional cellular automata, each cell takes three states: resting, excited and refractory. A resting cell excites if number of excited neighbours lies in a certain interval (excitation interval). An excited cell become refractory independently on states of its neighbours. A refractory cell returns to a resting state only if the number of excited neighbours belong to recovery int...

متن کامل

Computational Aspects of Modeling Excitable Media Using Cellular Automata

The study of excitable media is important in understanding the behavior of complex systems including mold growth, star formation, and cardiac tissue contraction. In this paper we discuss some computational aspects of modeling excitable media using multi-state cellular automata. In particular, we discuss implementation issues, algorithm development and visualization on the AGILA High Performance...

متن کامل

Quantifying Self-Organization in Cyclic Cellular Automata

Cyclic cellular automata (CCA) are models of excitable media. Started from random initial conditions, they produce several different kinds of spatial structure, depending on their control parameters. We introduce new tools from information theory that let us calculate the dynamical information content of spatial random processes. This complexity measure allows us to quantitatively determine the...

متن کامل

1 Phenomenology of Excitation in 2 - D Cellular Automata and Swarm Systems

The paper provides some results of a systematic investigation into the global and space-time behaviour of certain excitable systems. The systems include both static subjects of excitation (the cellular automata model of excitable media), and also excitable mobile agents moving on a lattice (lattice swarm systems). The duration of excitation of a cell of the automaton was the main parameter for ...

متن کامل

Asymptotic Behavior of Excitable Cellular Automata

This research was partially supported by research grants to each of the authors from the National Science Foundation We study two families of excitable cellular automata known as the Greenberg–Hastings model and the cyclic cellular automaton. Each family consists of local deterministic oscillating lattice dynamics, with parallel discrete-time updating, parametrized by the range of interaction, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • I. J. Bifurcation and Chaos

دوره 21  شماره 

صفحات  -

تاریخ انتشار 2011